Towards an Intermediate Language based on Graph Rewriting

نویسندگان

  • Hendrik Pieter Barendregt
  • Marko C. J. D. van Eekelen
  • John R. W. Glauert
  • Richard Kennaway
  • Marinus J. Plasmeijer
  • M. Ronan Sleep
چکیده

Lean is an experimental language for specifying computations in terms of graph rewriting. It is based on an alternative to Term Rewriting Systems (TRS) in which the terms are replaced by graphs. Such a Graph Rewriting System (GRS) consists of a set of graph rewrite rules which specify how a graph may be rewritten. Besides supporting functional programming, Lean also describes imperative constructs and allows the manipulation of cyclic graphs. Programs may exhibit non-determinism as well as parallelism. In particular, Lean can serve as an intermediate language between declarative languages and machine architectures, both sequential and parallel.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improvement of Metadiscourse Use among Iranian EFL Learners through a Process- based Writing Course

     The present study investigated the use of interactive metadiscourse resources (IMRs) in terms of appropriacy during a process- based writing course by applying qualitative and exploratory methods. Moreover, learners' perception was investigated to find out how confident they felt as they were writing and rewriting the drafts. 30 intermediate EFL learners were chosen to participate in this ...

متن کامل

LEAN: an intermediate language based on graph rewriting

The following full text is a preprint version which may differ from the publisher's version.

متن کامل

Dactl: An Experimental Graph Rewriting Language

A generalized computational model based on graph rewriting is presented along with Dactl, an associated compiler target (intermediate) language. An illustration of the capability of graph rewriting to model a variety of computational formalisms is presented by showing how some examples written originally in a number of languages can be described as graph rewriting transformations using Dactl no...

متن کامل

How to GRASP GOOD

The e orts of the past decade to provide database designers and users with more powerful tools for both modeling the considered application domain and manipulating this model, has resulted in a variety of declarative data languages of usually high complexity. In view of the implementation and optimization of such languages, it is often bene cial to use a second language as an intermediate, mach...

متن کامل

On a Uniform Representation of Transformation Systems

We discuss an intermediate language to represent transitions defining behaviours of autonomous agents. The language allows a uniform representation of several diagrammatic languages for specification of reactive systems, based on an underlying notion of transition. The translation of graph transformations to this language opens an opportunity for a notion of communication between agents represe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987